package leetcode.D300.T230;

import util.TreeNode;
import util.TreeUtil;

/**
 * @File Info: leetcode -- <M230>
 * @Author: 18362
 * @Create: 2022-03-16 14:02:08 星期三
 */
public class M230 {
    public static void main(String[] args) {
        TreeNode root = TreeUtil.deserialize("[3,1,4,null,2]");
        System.out.println(new Solution().kthSmallest(root, 3));
    }
}
